a modified pca approach for solving madm problems with dependent criteria
نویسندگان
چکیده
a basic assumption of madm methods such as saw and topsis is the statistical independence of criteria. violating this assumption would result in erroneous decisions. however, there are many cases in which criteria are dependent and based on this situation decision has to be made. in this paper, an approach based on the property of principal component analysis (pca) in producing independent variables is developed. in addition, weights of criteria are considered for decision making considering the fact that pca does not take them into account. since each of the new components obtained from pca is a linear combination of the initial criteria therefore one cannot say whether the new component is a larger the better variable or a smaller the better one so the decision making is difficult. to determine the direction of the new components, we developed a new method based on the variation mode chart. this method uses the weights of the initial criteria as well as their coefficients in the new components and considering the direction of the initial criteria it determines the direction of the new components. after that it becomes obvious which component is a larger the better or a smaller the better variable. meanwhile, the basic assumption of criteria independency is met. to show the efficiency of the proposed method, a real case in a military decision making problem as well as a numerical example is presented. in the military decision making problem, the mann-whitney non parametric test shows that the ranking of alternatives obtained from proposed method has more accordance with the ranking derived from expert's choice in comparison with the other methods ignoring the effect of dependencies. for more assurance about the performance of the proposed method, an example with a large number of alternatives and attributes (20 alternatives and 10 criteria) is presented. using the properties of pca, the initial criteria are replaced by four independent components. after determining the direction of new components using topsis and saw two different rankings are produced to choose from. for the validation of the proposed method this problem was also solved by ignoring dependencies of alternatives. the final results showed that using the proposed method will result in similar ranking under implementation of different madm methods, herein topsis and saw. ignoring the dependency would cause very different and sometimes conflicting ranking under implementation of different madm techniques. in other words, the proposed method results in more robust ranking compared to the methods that ignore the dependency of criteria.
منابع مشابه
A NEW APPROACH FOR SOLVING FULLY FUZZY QUADRATIC PROGRAMMING PROBLEMS
Quadratic programming (QP) is an optimization problem wherein one minimizes (or maximizes) a quadratic function of a finite number of decision variable subject to a finite number of linear inequality and/ or equality constraints. In this paper, a quadratic programming problem (FFQP) is considered in which all cost coefficients, constraints coefficients, and right hand side are characterized by ...
متن کاملA new approach for solving neutrosophic integer programming problems
Linear programming is one of the most important usages of operation research methods in real life, that includes of one objective function and one or several constraints which can be in the form of equality and inequality. Most of the problems in the real world are include of inconsistent and astute uncertainty, because of this reason we can’t obtain the optimal solution easily. In this paper, ...
متن کاملA dynamic programming approach for solving nonlinear knapsack problems
Nonlinear Knapsack Problems (NKP) are the alternative formulation for the multiple-choice knapsack problems. A powerful approach for solving NKP is dynamic programming which may obtain the global op-timal solution even in the case of discrete solution space for these problems. Despite the power of this solu-tion approach, it computationally performs very slowly when the solution space of the pr...
متن کاملA New Approach for Solving Grey Assignment Problems
Linear assignment problem is one of the most important practical models in the literature of linear programming problems. Input data in the cost matrix of the linear assignment problem are not always crisp and sometimes in the practical situations is formulated by the grey systems theory approach. In this way, some researchers have used a whitening technique to solve the grey assignment p...
متن کاملA Holistic Approach Based on MCDM for Solving Location Problems
Location decision is an integral part of organizational strategies involving many factorsthat may be conflicting in nature. This paper presents a holistic approach of the multi-criteria decisionmaking (MCDM) methodology to select the optimal location(s), which fits best for both investors andmanagers. A case study is also provided to illustrate the application of the proposed holistic approach....
متن کاملAn efficient approach for solving layout problems
This paper offers an approach that could be useful for diverse types of layout problems or even area allocation problems. By this approach there is no need to large number of discrete variables and only by few continues variables large-scale layout problems could be solved in polynomial time. This is resulted from dividing area into discrete and continuous dimensions. Also defining decision var...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
مهندسی صنایعجلد ۴۶، شماره ۲، صفحات ۱۳۳-۱۴۵
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023